A problem on partitions connected with Waring’s problem
نویسندگان
چکیده
منابع مشابه
A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are now consistent with the existing results on connected dominating set problem which is a special case of the minimum connected set cover problem.
متن کاملStanley’s Zrank Problem on Skew Partitions
We present an affirmative answer to Stanley’s zrank problem, namely, the zrank and rank are equal for any skew partition. We show that certain classes of restricted Cauchy matrices are nonsingular and furthermore, the signs depend on the number of zero entries. Similar to notion of the jrank of a skew partition, we give a characterization of the rank in terms of the Giambelli type matrices of t...
متن کاملRecent work connected with the Kakeya problem
where Sn−1 is the unit sphere in R. This paper will be mainly concerned with the following issue, which is still poorly understood: what metric restrictions does the property (1) put on the set E? The original Kakeya problem was essentially whether a Kakeya set as defined above must have positive measure, and as is well-known, a counterexample was given by Besicovitch in 1920. A current form of...
متن کاملThe Connected p-Center Problem with Extension
Let G(V, E, W) be a graph n vertices and m edges, where each edge e is associated with a positive distance W(e). The traditional p-Center problem is to locate some kind of facilities at p vertices of G to minimize the maximum distance between any vertex and its nearest facility. This paper proposes a practical constraint: the subgraph induced by the p facility vertices must be connected and the...
متن کاملOn Connected Bi-partitions of a Graph
We explore the connected bi-partitions of a graph i.e. spanning subgraphs of a graph which consist of exactly two connected components. We then relate the bi-partitions to the elements of the Moore-Penrose pseudoinverse of the graph Laplacian (L). Moreover, we establish a topological interpretation for the effective resistance metric and the so called Kirchoff index for the graph in terms of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1968
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1968-0225739-4